Probabilistic Deduction with Conditional Constraints over Basic Events
نویسندگان
چکیده
منابع مشابه
Probabilistic Deduction with Conditional Constraints over Basic Events
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globally complete probabilistic deduction with conditional constraints over basic events is NP-hard. We then concentrate on the special case of probabilistic deduction in conditional constraint trees. We elaborate very eecient techniques for globally complete probabilistic deduction. In ...
متن کاملIs the basic conditional probabilistic?
Nine experiments examined whether individuals treat the meaning of basic conditional assertions as deterministic or probabilistic. In Experiments 1-4, participants were presented with either probabilistic or deterministic relations, which they had to describe with a conditional. These experiments consistently showed that people tend only to use the basic if p then q construction to describe det...
متن کاملAssociative-commutative Deduction with Constraints Associative-commutative Deduction with Constraints
Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as uniication and ordering, and to deene eecient strategies, such as the basic requirements a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose ...
متن کاملProbabilistic Default Reasoning with Strict and Defeasible Conditional Constraints Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints
We present an approach to reasoning about statistical knowledge and degrees of belief, which is based on a combination of probabilistic reasoning from conditional constraints and default reasoning from conditional knowledge bases. More precisely, we generalize the notions of Pearl's entailment in system , Lehmann's lexicographic entailment, and Geffner's conditional entailment to strict and def...
متن کاملAbteilung Wissensbasierte Systeme Probabilistic Logic Programming with Conditional Constraints
We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0; 1℄ that describes a range for the conditional probability of the head of a clause given its body. We then analyze the complexity of selected probabilistic logic programming tasks. It turns ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1999
ISSN: 1076-9757
DOI: 10.1613/jair.577